Browsing by Subject "Lower and upper bounds"

Now showing items 1-7 of 7

    • Article  

      Bounds on FSM switching activity 

      Athanasopoulou, E.; Hadjicostis, Christoforos N. (2008)
      This paper obtains lower and upper bounds for the switching activity on the state lines of a finite state machine (FSM) that is driven by typical input sequences. More specifically, the paper provides bounds on the average ...
    • Conference Object  

      The impact of randomization in smoothing networks 

      Mavronicolas, Marios; Sauerwald, T. (2008)
      We revisit smoothing networks[3], which are made up of balancers and wires. Tokens arrive arbitrarily on w input wires and propagate asynchronously through the network
    • Article  

      The impact of randomization in smoothing networks 

      Mavronicolas, Marios; Sauerwald, T. (2010)
      We revisit randomized smoothing networks (Herlihy and Tirthapura in J Parallel Distrib Comput 66(5):626-632, 2006), which are made up of balancers and wires. We assume that balancers are oriented independently and uniformly ...
    • Article  

      Linearizability in the presence of drifting clocks and under different delay assumptions 

      Eleftheriou, Maria; Mavronicolas, Marios (1999)
      The cost of usingmessag e-passing to implement linearizable read/write objects for shared memory multiprocessors with drifting clocks is studied. We take as cost measures the response times for performingread and write ...
    • Conference Object  

      Multiagent reinforcement learning in the iterated prisoner's dilemma: Fast cooperation through evolved payoffs 

      Vassiliades, Vassilis; Christodoulou, Chris C. (2010)
      In this paper, we investigate the importance of rewards in Multiagent Reinforcement Learning in the context of the Iterated Prisoner's Dilemma. We use an evolutionary algorithm to evolve valid payoff structures with the ...
    • Article  

      A new model for selfish routing 

      Lücking, T.; Mavronicolas, Marios; Monien, Burkhard; Rode, M. (2008)
      In this work, we introduce and study a new, potentially rich model for selfish routing over non-cooperative networks, as an interesting hybridization of the two prevailing such models, namely the KPmodel [E. Koutsoupias, ...
    • Article  

      Rank-Deficient Solutions for Optimal Signaling over Wiretap MIMO Channels 

      Loyka, S.; Charalambous, Charalambos D. (2016)
      Capacity-achieving signaling strategies for the Gaussian wiretap multiple-input multple-output (MIMO) channel are investigated without the degradedness assumption. In addition to known solutions, a number of new rank-deficient ...